Bayesian tensorized neural networks with automatic rank selection
نویسندگان
چکیده
Tensor decomposition is an effective approach to compress over-parameterized neural networks and enable their deployment on resource-constrained hardware platforms. However, directly applying tensor compression in the training process a challenging task due difficulty of choosing proper rank. In order address this challenge, paper proposes low-rank Bayesian tensorized network. Our method performs automatic model via adaptive rank determination. We also present approaches for posterior density calculation maximum posteriori (MAP) estimation end-to-end our provide experimental validation two-layer fully connected network, 6-layer CNN 110-layer residual network where work produces 7.4 × 137 more compact from while achieving high prediction accuracy.
منابع مشابه
Project Portfolio Risk Response Selection Using Bayesian Belief Networks
Risk identification, impact assessment, and response planning constitute three building blocks of project risk management. Correspondingly, three types of interactions could be envisioned between risks, between impacts of several risks on a portfolio component, and between several responses. While the interdependency of risks is a well-recognized issue, the other two types of interactions remai...
متن کاملBayesian Optimization with Robust Bayesian Neural Networks
Bayesian optimization is a prominent method for optimizing expensive-to-evaluate black-box functions that is widely applied to tuning the hyperparameters of machine learning algorithms. Despite its successes, the prototypical Bayesian optimization approach – using Gaussian process models – does not scale well to either many hyperparameters or many function evaluations. Attacking this lack of sc...
متن کاملNeural Networks with Hybrid Morphological / Rank / Linear
We propose a general class of multilayer feed-forward neural networks where the combination of inputs in every node is formed by hybrid linear and nonlinear (of the morphological/rank type) operations. We demonstrate that this structure ooers eecient solutions to pattern classiication problems by requiring fewer nodes or fewer parameters to estimate than those needed by multilayer perceptrons. ...
متن کاملConvolutional neural networks with low-rank regularization
Large CNNs have delivered impressive performance in various computer vision applications. But the storage and computation requirements make it problematic for deploying these models on mobile devices. Recently, tensor decompositions have been used for speeding up CNNs. In this paper, we further develop the tensor decomposition technique. We propose a new algorithm for computing the low-rank ten...
متن کاملBayesian Rank Selection in Multivariate Regression
Estimating the rank of the coefficient matrix is a major challenge in multivariate regression, including vector autoregression (VAR). In this paper, we develop a novel fully Bayesian approach that allows for rank estimation. The key to our approach is reparameterizing the coefficient matrix using its singular value decomposition and conducting Bayesian inference on the decomposed parameters. By...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2021
ISSN: ['0925-2312', '1872-8286']
DOI: https://doi.org/10.1016/j.neucom.2021.04.117